Generalized Harary Games

نویسنده

  • András Pluhár
چکیده

There are a number of positional games known on the infinite chessboard. One of the most studied is the 5-in-a-row, whose rules are almost identical to the ancient Japanese Go-Moku. Along this line Harary asked if a player can achieve a translated copy of a given polymino P when the two players alternately take the squares of the board. Here we pose his question for general subsets of the board, and give a condition under which a draw is possible. Since a drawing strategy corresponds to a good 2-coloration of the underlying hypergraph, our result can be viewed as a derandomization of the Lovász Local Lemma.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Impartial achievement games for generating generalized dihedral groups

We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nimnumbers of this game for generalized dihedral groups, which are of the form Dih(A) = Z2 n A for a finite abelian group A.

متن کامل

Geodetic Games

We show that the geodetic game, introduced by Fraenkel and Harary, is decidable in polynomial time on AT-free graphs.

متن کامل

Maximal elements of $mathscr{F}_{C,theta}$-majorized mappings and applications to‎ ‎generalized games

In the paper‎, ‎some new existence theorems of maximal elements for‎ ‎$mathscr{F}_{C,theta}$-mappings and $mathscr{F}_{C,theta}$-majorized mappings are established‎. ‎As applications, ‎some new existence theorems of equilibrium points for‎ ‎one-person games‎, ‎qualitative games and generalized games are obtained‎. ‎Our results unify and generalize most known results‎ ‎in recent literature‎.

متن کامل

Connected, Bounded Degree, Triangle Avoidance Games

We consider variants of the triangle-avoidance game first defined by Harary and rediscovered by Hajnal a few years later. A graph game begins with two players and an empty graph on n vertices. The two players take turns choosing edges within Kn, building up a simple graph. The edges must be chosen according to a set of restrictions R. The winner is the last player to choose an edge that does no...

متن کامل

Distance-based Graph Invariants of Trees and the Harary Index

Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Acta Cybern.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1997